Lexicographic Breadth First Search - A Survey
نویسنده
چکیده
Lexicographic Breadth First Search, introduced by Rose, Tarjan and Lueker for the recognition of chordal graphs is currently the most popular graph algorithmic search paradigm, with applications in recognition of restricted graph families, diameter approximation for restricted families and determining a dominating pair in an AT-free graph. This paper surveys this area and provides new directions for further research in the area of graph searching.
منابع مشابه
Lexicographic Breadth First Search for Chordal Graphs
Applied to a chordal graph, lexicographic breadth rst search computes a perfect elimination scheme. We present a short elegant proof for this fact using only a new property of separators in chordal graphs.
متن کاملA Linear Algorithm to Color i-Triangulated Graphs
We show that i-triangulated graphs can be colored in linear time by applying lexicographic breadth-first search (abbreviated LexBFS) and the greedy coloring algorithm.
متن کاملSimpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search
Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive. They are related to posets and have applications in scheduling theory. This paper considers the problem of finding a transitive orientation of a comparability graph, a requirement for many of its applications. A linear-time algorithm is presented based on an elegant par...
متن کاملA Four-Sweep LBFS Recognition Algorithm for Interval Graphs
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based on six sweeps of Lexicographic Breadth-First Search (LBFS) and prove its correctness. They believe that their corresponding 5-sweep LBFS interval graph recognition algorithm is also correct. Thanks to the LBFS structure theory established mainly by Corneil et al., we are able to present a 4-sweep...
متن کاملA Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کامل